The second generalized Hamming weight for two-point codes on a Hermitian curve
نویسندگان
چکیده
منابع مشابه
Higher Hamming weights for locally recoverable codes on algebraic curves
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC codes, that are LRC codes from Norm-Trace curve. Finally, using some properties of Hermitian codes, we improve the bounds of distance proposed in [1] for some...
متن کاملOn the minimum distance and the minimum weight of Goppa codes from a quotient of the Hermitian curve
In this paper we study evaluation codes arising from plane quotients of the Hermitian curve, defined by affine equations of the form yq + y = xm, q being a prime power and m a positive integer which divides q+ 1. The dual minimum distance and minimum weight of such codes are studied from a geometric point of view. In many cases we completely describe the minimum-weight codewords of their dual c...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملRelative Generalized Hamming Weights of One-Point Algebraic Geometric Codes11The paper is registered to the ORCID of Olav Geil. For more details please visit Ryutaroh Matsumoto: http: //orcid.org/0000-0002-5085-8879 or Diego Ruano: http: //orcid.rg/0000-0001-7304-0087
Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes [26, 24]. In this paper we elaborate on the implication of these parameters and we devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes our bound is often tight. Furthermore, for these...
متن کاملThe Second Generalized Hamming Weight of Some Evaluation Codes Arising from Complete Bipartite Graphs
In this paper we compute the second generalized Hamming weight of the evaluation codes associated to complete bipartite graphs. The main result depends on the minimum distance and second generalized Hamming weight of the generalized Reed-Solomon codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 50 شماره
صفحات -
تاریخ انتشار 2009